Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits
نویسندگان
چکیده
In this paper we consider four different definitions for an extension of a partially defined Boolean function in which the input contains some missing bits. We show that, for many general and reasonable families of function classes, three of these extensions are mathematically equivalent. However we also demonstrate that such an equivalence does not hold for all classes.
منابع مشابه
Logical Analysis of Binary Data with Missing Bits
We model a given pair of sets of positive and negative examples, each of which may contain missing components, as a partially defined Boolean function with missing bits (pBmb) (T̃ , F̃ ), where T̃ ⊆ {0, 1, ∗} and F̃ ⊆ {0, 1, ∗}, and “∗” stands for a missing bit. Then we consider the problem of establishing a Boolean function (an extension) f : {0, 1} → {0, 1} belonging to a given function class C, ...
متن کاملVariations on extending partially defined Boolean functions with missing bits
In this paper we consider four different definitions for an extension of a partially defined Boolean function in which the input contains some missing bits. We show that, for many general and reasonable families of function classes, three of these extensions are mathematically equivalent. However we also demonstrate that such an equivalence does not hold for all classes. 1This research was part...
متن کاملBoolean Analysis of Incomplete Examples
As a form of knowledge acquisition from data, we consider the problem of deciding whether there exists an extension of a partially defined Boolean function with missing data (T̃ , F̃ ), where T̃ (resp., F̃ ) is a set of positive (resp., negative) examples. Here, “∗” denotes a missing bit in the data, and it is assumed that T̃ ⊆ {0, 1, ∗} and F̃ ⊆ {0, 1, ∗} hold. A Boolean function f : {0, 1} −→ {0, 1...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملBest-fit Interval Extensions of Partially Defined Boolean Functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their value is true, if and only if the input data viewed as an n-bit integer belongs to the interval [a, b] corresponding to the function concerned. In this paper we show, that the problem of finding an interval function, w...
متن کامل